Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

Lineage-driven Fault Injection Peter Alvaro Joshua Rosen UC Berkeley

Source URL: www.cs.berkeley.edu

• Fault-tolerant computer systems
• Data management
• Failure
• Fault tolerance
• Theory of computation
• Consensus
• Two-phase commit protocol
• Byzantine fault tolerance
• Data lineage
• Distributed computing
• Software bug
• Fault injection

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

A Non-monotonic Extension of Universal Moral Grammar Theory Gert-Jan Munneke () Institute for Logic, Language and Computation University of Amsterdam 107 Science Park, Amsterdam, 1090 GE The Netherlands

Source URL: jakubszymanik.com

J. Symbolic Computation, 351–369 Lattices of Compatibly Embedded Finite Fields† WIEB BOSMA‡, JOHN CANNON§ AND ALLAN STEEL¶ Computational Algebra Group, School of Mathematics and Statistics, The Univers

Source URL: www.math.ru.nl

• Field theory
• Polynomials
• Computer algebra
• Finite fields
• Abstract algebra
• Conway polynomial
• Field
• Minimal polynomial
• Embedding
• Model theory
• Factorization of polynomials
• Duality

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

V22Honors Theory of Computation Problem Set 3 Solutions Problem 1 Solution: The class of languages recognized by these machines is the exactly the class of regular languages, thus this TM variant is not equival

Source URL: ftp.cs.nyu.edu

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

Controlling Extraction in Abstract Categorial Grammars Sylvain Pogodalla1 and Florent Pompigne2 1

Source URL: www.angl.hu-berlin.de

• Theoretical computer science
• Grammar frameworks
• Complexity classes
• Theory of computation
• Type theory
• Formal languages
• Mathematics
• Categorial grammar
• NP
• Lambda calculus
• Model theory

CSCI-UA: Honors Theory of Computation Problem Set 3 All problems are worth 10 points. Collaboration is allowed, but you must write your own solutions. Write the names of your collaborators (and your own!). Unles

Source URL: ftp.cs.nyu.edu